Providing QoS in OSPF based best effort network using load sensitive routing

نویسندگان

  • Anunay Tiwari
  • Anirudha Sahoo
چکیده

In an open shortest path first (OSPF) based best effort network, when a packet experiences congestion, the routing subsystem cannot send it through an alternate path. Thus, it fails to provide desired quality of service (QoS) during congestion. In order to provide QoS we have reported three different load sensitive routing (LSR) protocols in [A. Sahoo, An OSPF based load-sensitive QoS routing algorithm using alternate paths, in: IEEE International Conference on Computer Communication Networks, October 2002; A. Tiwari, A. Sahoo, Providing QoS support in OSPF based best effort network, in: IEEE International Conference on Networks, November 2005; A. Tiwari, A. Sahoo, A local coefficient based load sensitive routing protocol for providing QoS, in: IEEE International Conference on Parallel and Distributed Systems, July 2006]. The LSR protocol forwards packets through alternate paths in case of congestion. The number of alternate paths at any node depends on the value of operating parameter or coefficient used for alternate path calculation. Though the basic protocol in these cases was the same, the methods of choosing operating parameter were different. We referred to these three methods as LSR [A. Sahoo, An OSPF based load-sensitive QoS routing algorithm using alternate paths, in: IEEE International Conference on Computer Communication Networks, October 2002], E-LSR [A. Tiwari, A. Sahoo, Providing QoS support in OSPF based best effort network, in: IEEE International Conference on Networks, November 2005] and L-LSR [A. Tiwari, A. Sahoo, A local coefficient based load sensitive routing protocol for providing QoS, in: IEEE International Conference on Parallel and Distributed Systems, July 2006] coefficient methods. In this paper, we present the LSR protocol along with the three coefficient calculation methods pointing out the reason for going from one method to the next. The main strength of our LSR protocol is that it provides loop free alternate paths in the event of congestion and can interwork with routers running vanilla OSPF protocol. We show through simulation that the LSR protocol based on any of the three different coefficient calculation methods performs much better than OSPF and that out of the three methods proposed by us, L-LSR performs the best. 2006 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Load-sensitive Qos Routing Algorithm in Best-effort Environment

The increase in real-time applications such as Voice over IP, audio and video streaming in the public Internet has warranted QoS based routing. But today’s Internet largely supports best effort traffic. Thus, a QoS routing in the best effort environment is required to support real-time applications. Flooding of some QoS attributes (e.g. available bandwidth) have been used for QoS routing. But w...

متن کامل

An OSPF based load sensitive QoS routing algorithm using alternate paths

Real-time applications such as Voice over IP, audio and video streaming require Quality of Service (QoS). Such applications are being executed over the public Internet. Since today’s Internet largely supports best effort traffic, QoS routing in the best effort environment is required to support real-time applications. Some QoS routing use source routing and others use flooding of some QoS attib...

متن کامل

Addressing OSPF Load in IP/MPLS Networks

There is an increasing trend towards deploying IP/MPLS networks that provide value added services such as virtual private networks, guaranteed bandwidth pipes, etc. to network users. Such networks are required to be highly reliable and robust even under peak load and/or unanticipated situations of link/router failures. TE mechanisms typically involve path computation based on information obtain...

متن کامل

Multi-class QoS routing strategies based on the network state

Hedia Kochkar, Takeshi Ikenaga, Yuji Oie Department of Computer Science and Electronics, Kyushu Institute of Technology, 680-4 kawazu, Iizuka, Fukuoka 820-8502 Japan sharing, where network resources are dynamically shared between different service classes of traffic. For example, in [4], the authors study methods to improve the throughput of Best Effort traffic in a network on which resources ...

متن کامل

QoS routing algorithm based on multiclasses traffic load

Most of the QoS-based routing schemes proposed so far focus on improving the performance of individual service classes. In a multi-class network where high priority QoS traffic coexists with best-effort traffic, routing decision for QoS sessions will have an effect on lower one. A mechanism that allows dynamic sharing link among multiple classes of traffic is needed. In this paper we propose a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Simulation Modelling Practice and Theory

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2007